1927C - Choose the Different Ones - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);

    int t; cin >> t;
    while(t--){
        int n,m,k; cin >> n >> m >> k;
        int a[k+1], b[k+1];
        fill(a,a+k+1,0);
        fill(b,b+k+1,0);
        for(int i = 0; i < n; i++){
            int temp; cin >> temp;
            if(temp <= k){
                a[temp] = 1;
            }      
        }
        for(int i = 0; i < m; i++){
            int temp; cin >> temp;
            if(temp <= k){
                b[temp] = 1;
            }    
        }
        int ahave = 0, bhave = 0, ans = 1;
        for(int i = 1; i <= k; i++){
            if(a[i] == 0 and b[i] == 1){
                bhave += 1;
            } else if(a[i] == 1 and b[i] == 0){
                ahave += 1;
            } else if(a[i] == 0 and b[i] == 0){
                ans = 0;
            }
        }

        if(ahave > k/2 or bhave > k/2){
            ans = 0;
        }
        if(ans == 0){
            cout << "NO";
        } else {
            cout << "YES";
        }
        cout << "\n";
    }
    
    return 0;    
}